/*
 * Project: Code
 * File Created at 2024/1/15
 @Type Unique_Paths.java
 @author Goodwin
 * Website : https://leetcode.cn/problems/unique-paths/description/  62
*/

package Dynamic_Program;

public class Unique_Paths {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
//        初始化
        dp[0][0] = 0;
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int i = 0; i < n; i++) {
            dp[0][i] = 1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i][j-1] + dp[i-1][j];
            }
        }
        return dp[m-1][n-1];
    }
}
